排序方式: 共有60条查询结果,搜索用时 187 毫秒
51.
52.
Consider n jobs (J1, …, Jn), m working stations (M1, …, Mm) and λ linear resources (R1, …, Rλ). Job Ji consists of m operations (Oi1, …, Oim). Operation Oij requires Pk(i, j) units of resource Rk to be realized in an Mj. The availability of resource Rk and the ability of the working station Mh to consume resource Rk, vary over time. An operation involving more than one resource consumes them in constant proportions equal to those in which they are required. The order in which operations are realized is immaterial. We seek an allocation of the resources such that the schedule length is minimized. In this paper, polynomial algorithms are developed for several problems, while NP-hardness is demonstrated for several others. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 51–66, 1998 相似文献
53.
The client‐contractor bargaining problem addressed here is in the context of a multi‐mode resource constrained project scheduling problem with discounted cash flows, which is formulated as a progress payments model. In this model, the contractor receives payments from the client at predetermined regular time intervals. The last payment is paid at the first predetermined payment point right after project completion. The second payment model considered in this paper is the one with payments at activity completions. The project is represented on an Activity‐on‐Node (AON) project network. Activity durations are assumed to be deterministic. The project duration is bounded from above by a deadline imposed by the client, which constitutes a hard constraint. The bargaining objective is to maximize the bargaining objective function comprised of the objectives of both the client and the contractor. The bargaining objective function is expected to reflect the two‐party nature of the problem environment and seeks a compromise between the client and the contractor. The bargaining power concept is introduced into the problem by the bargaining power weights used in the bargaining objective function. Simulated annealing algorithm and genetic algorithm approaches are proposed as solution procedures. The proposed solution methods are tested with respect to solution quality and solution times. Sensitivity analyses are conducted among different parameters used in the model, namely the profit margin, the discount rate, and the bargaining power weights. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009 相似文献
54.
在交叉学科研究中创新指挥与控制 总被引:1,自引:0,他引:1
用辩证唯物论的观点,阐述了指挥与控制复杂科学的产生背景、研究对象与方法,以及在相关领域的应用前景,并就如何在学科交叉、渗透、融合中开展指挥与控制这一新兴学科研究提出了建议. 相似文献
55.
Patrick A. Mello 《Contemporary Security Policy》2019,40(1):38-55
Recent scholarship in security studies has started to explore the causes and consequences of various forms of national restrictions in multinational military operations (MMOs). This article makes a conceptual contribution to this literature by developing a theoretical framework of national restrictions in MMOs that distinguishes between structural, procedural, and operational restrictions. I argue that these types of restrictions are governed by different causal mechanisms. Structural restrictions are relatively stable over time and effect deployment decisions irrespective of other factors. Procedural restrictions, on the other hand, can constitute veto points against deployment only in combination with distinct political preferences. Finally, operational restrictions directly affect the rules of engagement of troop contributing countries. The article illustrates the three types of restrictions and their interaction with empirical examples from a range of countries and sketches their impact on MMO deployment decisions and mandates. 相似文献
56.
基于动态罚函数遗传算法的电磁探测卫星多星规划方法 总被引:9,自引:3,他引:6
针对电磁探测卫星的特点,考虑其主要约束条件,建立了多星联合规划数学模型,提出了基于遗传算法的电磁探测卫星多星规划算法.为处理遗传算法迭代过程中产生的不可行解,引入了基于罚函数法的约束处理方法.针对罚函数法中惩罚系数难以确定的特点,设计了惩罚系数自适应调整的动态罚函数机制.根据模拟的数据进行实验及分析,表明该方法能有效解决电磁探测卫星多星规划问题. 相似文献
57.
In this research, we consider robust simulation optimization with stochastic constraints. In particular, we focus on the ranking and selection problem in which the computing time is sufficient to evaluate all the designs (solutions) under consideration. Given a fixed simulation budget, we aim at maximizing the probability of correct selection (PCS) for the best feasible design, where the objective and constraint measures are assessed by their worst‐case performances. To simplify the complexity of PCS, we develop an approximated probability measure and derive the asymptotic optimality condition (optimality condition as the simulation budget goes to infinity) of the resulting problem. A sequential selection procedure is then designed within the optimal computing budget allocation framework. The high efficiency of the proposed procedure is tested via a number of numerical examples. In addition, we provide some useful insights into the efficiency of a budget allocation procedure. 相似文献
58.
《防务技术》2020,16(6):1130-1141
Based on fuzzy adaptive and dynamic surface (FADS), an integrated guidance and control (IGC) approach was proposed for large caliber naval gun guided projectile, which was robust to target maneuver, canard dynamic characteristics, and multiple constraints, such as impact angle, limited measurement of line of sight (LOS) angle rate and nonlinear saturation of canard deflection. Initially, a strict feedback cascade model of IGC in longitudinal plane was established, and extended state observer (ESO) was designed to estimate LOS angle rate and uncertain disturbances with unknown boundary inside and outside of system, including aerodynamic parameters perturbation, target maneuver and model errors. Secondly, aiming at zeroing LOS angle tracking error and LOS angle rate in finite time, a nonsingular terminal sliding mode (NTSM) was designed with adaptive exponential reaching law. Furthermore, combining with dynamic surface, which prevented the complex differential of virtual control laws, the fuzzy adaptive systems were designed to approximate observation errors of uncertain disturbances and to reduce chatter of control law. Finally, the adaptive Nussbaum gain function was introduced to compensate nonlinear saturation of canard deflection. The LOS angle tracking error and LOS angle rate were convergent in finite time and whole system states were uniform ultimately bounded, rigorously proven by Lyapunov stability theory. Hardware-in-the-loop simulation (HILS) and digital simulation experiments both showed FADS provided guided projectile with good guidance performance while striking targets with different maneuvering forms. 相似文献
59.
提出了满足测量视场、最小脉冲间隔、最大脉冲受限等约束的燃料最省的航天器近距离交会多脉冲斜滑制导算法.建立了近距离交会(接近和撤离)多脉冲斜滑制导算法的统一数学模型;提出了理想交会轨道距离和速率的指数函数变化关系,使得算法能够实现任意时间的近距离交会,同时满足接近操作减速和撤离过程加速的任务要求;设计了对数函数映射法进行脉冲寻优.最后通过接近段和撤离段的操作仿真算例进行验证,仿真结果表明,相比最优化方法,对数函数映射法以较小的计算量实现了较好的寻优效果;算法能够以较省的燃料消耗实现轨道面内任意方向、任意时间内满足约束的近距离交会. 相似文献
60.